Estimating deep Littlewood-Richardson Coefficients
نویسنده
چکیده
Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups (GLn). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for Littlewood-Richardson coefficients corresponding to indices sufficiently far from the boundary of the Littlewood Richardson cone. 2. A proof of approximate log-concavity of the above mentioned class of Littlewood-Richardson coefficients. Résumé: Coefficients de Littlewood Richardson sont des constantes de structure apparaissant dans la théorie de la reprsentation des groupes linéaires généraux (GLn). Les principaux résultats de cette étude sont les suivants: 1. Un schéma d’approximation polynomiale randomisée fortement pour des coefficients de Littlewood-Richardson correspondant aux indices suffisamment loin de la limite du cône Littlewood Richardson. 2. Une preuve de l’approximatif log-concavité de la classe de coefficients de Littlewood-Richardson mentionné ci-dessus.
منابع مشابه
A max-flow algorithm for positivity of Littlewood-Richardson coefficients
Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL(n,C). They have a wide variety of interpretations in combinatorics, representation theory and geometry. Mulmuley and Sohoni pointed out that it is possible to decide the positivity of Littlewood-Richardson coefficients in polynomial time...
متن کاملLittlewood-Richardson coefficients and Kazhdan-Lusztig polynomials
We show that the Littlewood-Richardson coefficients are values at 1 of certain parabolic Kazhdan-Lusztig polynomials for affine symmetric groups. These q-analogues of Littlewood-Richardson multiplicities coincide with those previously introduced in [21] in terms of ribbon tableaux.
متن کاملA polynomiality property for Littlewood-Richardson coefficients
We present a polynomiality property of the Littlewood-Richardson coefficients c λμ . The coefficients are shown to be given by polynomials in λ, μ and ν on the cones of the chamber complex of a vector partition function. We give bounds on the degree of the polynomials depending on the maximum allowed number of parts of the partitions λ, μ and ν. We first express the Littlewood-Richardson coeffi...
متن کاملSymmetric Skew Quasisymmetric Schur Functions
The classical Littlewood-Richardson rule is a rule for computing coefficients in many areas, and comes in many guises. In this paper we prove two Littlewood-Richardson rules for symmetric skew quasisymmetric Schur functions that are analogous to the famed version of the classical Littlewood-Richardson rule involving Yamanouchi words. Furthermore, both our rules contain this classical Littlewood...
متن کاملThe Horn Recursion for Schur P - and Q - Functions : Extended
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a LittlewoodRichardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P and...
متن کامل